Matrix Games, Linear Programming, and Linear Approximation

نویسنده

  • L. N. Vaserstein
چکیده

qi = 1, pA ≥ v ≥ Aq. The number v is known as the value of game. The pair (p, q) is known as an equilibrium for the matrix game. As usual, x ≥ 0 means that every entry of the vector x is ≥ 0. We write y ≤ t for a vector y and a number t if every entry of y is ≤ t. We go even further in abusing notation, denoting by y− t the vector obtaining from y by subtracting t from every entry. Similarly we denote by M + c the matrix obtained from M by adding a number c to every entry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving matrix games with hesitant fuzzy pay-offs

The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...

متن کامل

An interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers

The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

متن کامل

Extracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method

In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...

متن کامل

A BI-OBJECTIVE PROGRAMMING APPROACH TO SOLVE MATRIX GAMES WITH PAYOFFS OF ATANASSOV’S TRIANGULAR INTUITIONISTIC FUZZY NUMBERS

The intuitionistic fuzzy set has been applied to game theory very rarely since it was introduced by Atanassov in 1983. The aim of this paper is to develop an effective methodology for solving matrix games with payoffs of Atanassov’s triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concepts and ranking order relations of Atanassov’s TIFNs are defined. A pair of bi-object...

متن کامل

BI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS

In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...

متن کامل

A new Approximation to the solution of the linear matrix equation AXB = C

It is well-known that the matrix equations play a significant role in several applications in science and engineering. There are various approaches either direct methods or iterative methods to evaluate the solution of these equations. In this research article, the homotopy perturbation method (HPM) will employ to deduce the approximated solution of the linear matrix equation in the form AXB=C....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0609056  شماره 

صفحات  -

تاریخ انتشار 2006